Propositional mixed logic: its syntax and semantics
نویسندگان
چکیده
In this paper, we present a propositional logic (called mixed logic) containing disjoint copies of minimal, intuitionistic and classical logics. We prove a completeness theorem for this logic with respect to a Kripke semantics. We establish some relations between mixed logic and minimal, intuitionistic and classical logics. We present at the end a sequent calculus version for this logic.
منابع مشابه
Semantics of Propositional Fuzzy Modal Logic with Evaluated Syntax and its Application to Fuzzy Decision Implications
This paper deals with propositional fuzzy modal logic with evaluated syntax based on MV-algebras. We focus on its semantical theory from the viewpoint of Pavelka’s graded semantics of propositional fuzzy logic, investigate the L-tautologies based on different Kripke frames. We also define the notion of Lsemantical consequence operation, its some basic properties are obtained. Finally, this pape...
متن کاملFuzzy Propositional Formulas under the Stable Model Semantics
We define a stable model semantics for fuzzy propositional formulas, which generalizes both fuzzy propositional logic and the stable model semantics of classical propositional formulas. The syntax of the language is the same as the syntax of fuzzy propositional logic, but its semantics distinguishes stable models from non-stable models. The generality of the language allows for highly configura...
متن کاملExpressiveness of Temporal Logics
Propositional Logic, Modal Logic and Temporal Logic Definition The syntax of propositional logics is defined as φ ::= p | ¬φ | φ ∨ φ | φ ∧ φ where p ranges over a (finite) set of atomic propositions AP. The semantics is given by truth tables, e.g., for p ∧ q: ∧ > ⊥ > > ⊥ ⊥ ⊥ ⊥ Propositional Logic, Modal Logic and Temporal Logic Definition The syntax of propositional logics is defined as φ ::= p...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملThe Semantics of Propositional Contexts
In this paper we investigate the semantic properties of contexts. We describe the syntax and semantics of the propositional logic of context. This logic extends classical propositional logic in two ways. Firstly, a new modality, ist(;), is introduced. It is used to express that the sentence, , holds in the context. Secondly, each context has its own vocabulary, i.e. a set of propositional atoms...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Applied Non-Classical Logics
دوره 13 شماره
صفحات -
تاریخ انتشار 2003